A Matrix Substitution Method of Constructing Partially Balanced Designs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructing t-designs from t-wise balanced designs

We give a construction to obtain a t-design from a t-wise balanced design. More precisely, given a positive integer k and a t(v, {k1, k2, . . . , ks}, λ) design D, with with all block-sizes ki occurring in D and 1 ≤ t ≤ k ≤ k1 < k2 < · · · < ks, the construction produces a t-(v, k, nλ) design D∗, with n = lcm( ( k1−t k−t ) , . . . , ( ks−t k−t ) ). We prove that Aut(D) is a subgroup of Aut(D∗),...

متن کامل

A New Technique For Constructing Pairwise Balanced Designs From Groups

We introduce a new technique for constructing pairwise balanced designs and group divisible designs from finite groups. These constructed designs do not give designs with new parameters but our construction gives rise to designs having a transitive automorphism group that also preserves the resolution classes.

متن کامل

A method for constructing generalised residual designs

A t-design rc with parameters t (u, k, A) is a finite incidence structure with u points and k points on each block such that any t-subset is contained in exactly 1 blocks. Incidence between a point P and a block d is denoted by P 1 d or d 1 P. We usually denote by b the number of blocks of 17. A block p of a t-design (t > 1) is said to be repeated x times if there exists exactly x blocks d such...

متن کامل

On construction of partially balanced n-ary designs

A new method of constructing a series of partially balanced ternary (PBT) designs is presented. In the method, we have added the corresponding rows of incidence matrices of a BIB design and a PBIB design, both obtained from single initial block with at least one element in common between them. The BIB and PBIB designs above were obtained by method of differences. We have also constructed PBT de...

متن کامل

Key Predistribution Using Partially Balanced Designs in Wireless Sensor Networks

We propose two deterministic key predistribution schemes in a Wireless Sensor Network (WSN), in which sensor nodes are deployed randomly. Both the schemes are based on Partially Balanced Incomplete Block Designs (PBIBD). An important feature of our scheme is that every pair of nodes can communicate directly, making communication faster and efficient. The number of keys per node is of the order ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Mathematical Statistics

سال: 1960

ISSN: 0003-4851

DOI: 10.1214/aoms/1177705985